Parsing mit inkonsistenten Grammatiken
نویسنده
چکیده
A novel approach to the parsing of natural language based on weighted constraints is presented. Wellformedness conditions are exclusively expressed by means of constraints and no generative rule component is available. In general, constraints can be violated and contradictory requirements of a grammar are tolerated. Additional representational levels allow the integration of different linguistic perspectives into a coherent model, thus contributing jointly to the computation of the most plausible structural interpretation. A number of solution procedures is available for such a parsing problem. Their properties are discussed with respect to possible analogies to human language processing, focussing on robustness against deviating utterances and external temporal pressure.
منابع مشابه
Lexicalization and Grammar Development Lexicalization and Grammar Development
In this paper we present a fully lexicalized grammar formalism as a particularly attractive framework for the specification of natural language grammars. We discuss in detail Feature-based, Lexicalized Tree Adjoining Grammars (FB-LTAGs), a representative of the class of lexicalized grammars. We illustrate the advantages of lexicalized grammars in various contexts of natural language processing,...
متن کاملLexicalization and Grammar Development
In this paper we present a fully lexicalized grammar formalism as a particularly attractive framework for the specification of natural language grammars. We discuss in detail Feature-based, Lexicalized Tree Adjoining Grammars (FB-LTAGs), a representative of the class of lexicalized grammars. We illustrate the advantages of lexicalized grammars in various contexts of natural language processing,...
متن کاملMetallartefakte in der Computertomographie. Softwarebasierte Ansätze zur Artefaktreduktion
In der Computertomographie führen Metallobjekte innerhalb des durchstrahlten Körpers zu einer nichtlinearen Veränderung des Röntgenspektrums. Nach Rekonstruktion der Schnittbilder aus diesen inkonsistenten Projektionsdaten treten häufig sternförmige Artefakte um die Metallobjekte herum auf. Diese Beeinträchtigung der Bildqualität kann dazu führen, dass die Bilder entweder nicht mehr zur Diagnos...
متن کاملFiltern von Spam-Nachrichten mit kontextfreien Grammatiken
Spam wird heute überwiegend mittels so genannter musterbasierte SpamAlgorithmen über Botnetze verteilt. Bei musterbasiertem Spam werden die SpamNachrichten erst von den Bots aus einem Muster (template) und Fülldaten zusammengesetzt. Filteransätze für musterbasierten Spam versuchten bisher, dieses Muster aus den abgefangenen Nachrichten zu extrahieren und auf reguläre Ausdrücke abzubilden. Diese...
متن کاملA Framework for Parsing Algorithm Speciication and Analysis ?
Parsing schemata are deened as an intermediate level of abstraction between context-free grammars and parsers. Clear, concise speciications of radically diierent parsing algorithms can be expressed as parsing schemata. Moreover, because of the uniformity of these speci-cations, relations between diierent parsing algorithms can be formally established. The framework is introced in an informal ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Kognitionswissenschaft
دوره 9 شماره
صفحات -
تاریخ انتشار 2002